Peer-to-peer networking interference remediation

ABSTRACT

Presented herein are methodologies for managing radio resources in a venue that implements a high density wireless infrastructure. The methodology includes detecting, using wireless access points, neighbor awareness networking (NAN) communications broadcast by a mobile device, determining a wireless channel on which the mobile device is sending the NAN communications, predicting a destination of the mobile device based on a path, through a predetermined venue, being taken by the mobile device, the path being detected using the wireless access points; and implementing a radio resource management remediation technique to reduce radio interference that is expected to be caused by the NAN communications broadcast by the mobile device at the destination based on the wireless channel and the destination.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.16/365,030, filed Mar. 26, 2019, the subject matter of which isincorporated herein by reference in its entirety.

TECHNICAL FIELD

The present disclosure relates to monitoring mobile peer-to-peernetworking groups and implementing remediation techniques to alleviatepotential interference caused by such groups.

BACKGROUND

Wi-Fi Aware, also known as “Neighbor Awareness Networking” (NAN), allowsmobile stations (STAs), such as mobile phones in proximity to oneanother, to form peer groups and exchange information directly, withoutnecessarily relying on an access point (AP) as an intermediary node. Thegoal of NAN is to organize peer-to-peer (P2P) groups, where individualdevices may want to exchange information on a topic of common interest.

In operation, a single NAN device sends discovery messages on knownchannels. Until groups are formed, these messages are not synchronizedbetween devices, resulting in the potential of high channel noise. OnceNAN devices hear one another, they meet at an interval (a rendezvouspoint in time) decided by an elected group leader. At that point, thedevices are synchronized in time. At the rendezvous point in time, adiscovery window allows the NAN group participants to exchangeinformation on services that they may want to share. If they havenothing to share, then they have no reason to stay in the same group.Therefore, if no mutual interest is found, a NAN device can disengagefrom the group and attempt to discover and synchronize with othergroups. Devices that have “things to share” will likely stay in thegroup. “Things to share” can be any type of data, from “I am a Minecraftplayer and will share my scores” to “Jerome family, group to exchangephotos”. In such cases, interested members of the group will subscribeto the service (whatever is shared), and the offering STA will giveanother rendezvous point in time (typically on the same channel) wherethat service will be offered.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts components of a network, including access points, mobilestations and NAN group detection and channel interference remediationlogic in accordance with an example embodiment.

FIG. 2 depicts tracking a given STA in a stadium venue in accordancewith an example embodiment.

FIG. 3 shows NAN groups on particular channels overlaid on a partialstadium map including access points on particular channels in accordancewith an example embodiment.

FIG. 4 shows adjacent or nearby access points in connection withdiscussing how NAN group detection and channel interference remediationlogic might become aware of interference caused by a NAN group inaccordance with an example embodiment.

FIG. 5 is a flow chart depicting a series of operations performed by NANgroup detection and channel interference remediation logic in accordancewith an example embodiment.

FIG. 6 depicts a device (e.g., a server) that might host and execute NANgroup detection and channel interference remediation logic in accordancewith an example embodiment.

DESCRIPTION OF EXAMPLE EMBODIMENTS Overview

Presented herein are methodologies for managing radio resources in avenue that implements a high density wireless infrastructure. Themethodology includes detecting, using wireless access points, neighborawareness networking (NAN) communications broadcast by a mobile device,determining a wireless channel on which the mobile device is sending theNAN communications, predicting a destination of the mobile device basedon a path, through a predetermined venue, being taken by the mobiledevice, the path being detected using the wireless access points, andimplementing a radio resource management remediation technique to reduceradio interference that is expected to be caused by the NANcommunications broadcast by the mobile device at the destination basedon the wireless channel and the destination.

A device or apparatus is also described. The device may include aninterface unit configured to enable network communications, a memory,and one or more processors coupled to the interface unit and the memory,and configured to: detect, using wireless access points, neighborawareness networking (NAN) communications broadcast by a mobile device,determine a wireless channel on which the mobile device is sending theNAN communications, predict a destination of the mobile device based ona path, through a predetermined venue, being taken by the mobile device,the path being detected using the wireless access points, and implementa radio resource management remediation technique to reduce radiointerference that is expected to be caused the NAN communicationsbroadcast by the mobile device at the destination based on the wirelesschannel and the destination.

EXAMPLE EMBODIMENTS

Wi-Fi Aware, also known as “Neighbor Awareness Networking” (NAN), allowsmobile stations (STAs), such as mobile phones in proximity to oneanother, to form peer groups and exchange information directly, withoutnecessarily relying on an access point (AP) as an intermediary node. TheNAN communication mode is anticipated to be widely adopted. However, NANpresents considerable challenges in managed high-density networks, suchas a stadium environment. Specifically, given that NAN groups form anddissolve, and STAs are mobile, peer-to-peer (P2P) channels can becomecongested, and thus collisions can increase not only between P2P groupsthemselves, but also potentially between the P2P groups and wirelessinfrastructure cells.

The P2P channels may be avoided entirely by the managed infrastructureAP, however, this scheme is impractical for several reasons.

For example, in the 2.4 GHz band, there are only three non-overlappingchannels, and losing even one entire channel is a major challenge, inthat it is very difficult, if not impossible, to ensure comprehensivecoverage with only 2 channels without major overlapping base stationsubsystem (OBSS) collisions.

Also, NAN determines a primary advertisement channel (e.g., ch 6 in 2.4GHz; ch 149 or 40 in 5 GHz), but data exchange can be set to use otherchannels, making NAN activity detection and avoidance difficult.

To optimize radio resource management (RRM), it would be beneficial topredict the location of NAN activity, and react in a manner that canreduce the likelihood of interference caused by a NAN group's activity.The embodiments described herein provide approaches for such prediction,and further provide prophylactic management techniques in an effort tominimize interference in the wireless infrastructure caused byestablished NAN groups.

NAN primarily functions with 3 phases, as follows:

1. Rendezvous: in this phase (phase 1), a STA starts and broadcastsrendezvous point information (specific channel and specific time).

2. Service exchange: in this phase (phase 2), two or more NAN devicesmeet on the specific channel at the specific point in time and exchangeinformation on services they can offer (e.g. “Rob's family picturesharing”).

3. Data exchange: in this phase (phase 3), NAN devices that share thesame service interest exchange data. This can occur on the rendezvouschannel or on another channel determined during phase 2.

In accordance with an embodiment, phase 1 signals emitted by NAN-capableSTAs are detected as the STAs enter a predetermined venue having amanaged high-density network (e.g., stadium, conference center, etc.).

More specifically, reference is made to FIG. 1, which depicts componentsof a network 100, including access points (APs) 125, mobile stations(STAs) 150 and NAN group detection and channel interference remediationlogic 190 hosted on a server 180.

As NAN-capable STAs 150 move through the facility or predetermined venue105, a probabilistic machine (which may be implemented as part of NANgroup detection and channel interference remediation logic 190)determines the likely trajectories of the user (i.e., the user of agiven STA 150). Suppose a user enters a stadium, and walks throughconstrained entry points (entrances/doors). As long as the STA 150 isawake, and assuming at least one application is running on the STA 150that has enabled NAN, STA 150 will send NAN discovery messages. Such NANdiscovery messages are picked up by the wireless infrastructure. Therewill be many STAs 150 going through entry points, and sending NANdiscovery messages. By keeping track of the paths that individual STAs150 take (by tracking each STA using respective APs 125 deployed alongeffectively all possible paths), a machine learning technique (again,implemented as part of NAN group detection and channel interferenceremediation logic 190) can learn pathway patterns, and can be configuredto thus predict, for a given new STA 150, which path it might likelytake, and thus at which, e.g., seating section, the given new STA 150will finally arrive.

FIG. 2 depicts tracking a given STA in a stadium venue in accordancewith an example embodiment. As shown, there are many possible users andtrajectories, and many users may follow trajectories along the paths210, 215, 220, but the following discussion focuses on a STA followingthe trajectory 230.

When a STA is detected at point A in FIG. 2, it can be determined from aprior machine learning training set that the STA is, e.g., unlikely togo through walls (although location imprecision or staff shortcuts mayprovide such visual overlaps on the map), and is, instead, likely to goup to any zone up to seating area 119, or go left to a zone up to 101 or201. This is known because it may be learned that users walking, forexample, to area 117, tend to enter by the upper right entrance. Inother words, the possible trajectories and their probabilities can beknown from the training set.

There is, of course, a low probability that a user will use the lowerright entrance of the stadium, and nevertheless go all the way to, e.g.,seating area 117. Determining this type of probability may beaccomplished using, e.g., a random forest technique.

Thus, when a user enters the stadium through the lower right door, amodel predicts that the user can only go to A, then can turn left orright. Depending on the size of the training set, the model candetermine the probability of the user going up or down. Theprobabilities should be about 0.5 for up, 0.5 for down. Similarly, atpoint A, there will be a distribution of probabilities that the user mayend up in area 120, 121, 122 etc.

As the user progresses along the path 230 through points B and C, theprobability that the user will end up in area 119 increases, while theprobability that the user changes their mind and ends up, e.g., in area101 decreases. At point D, the probability that the user will end up in119 or 120 is very high, and the probability that the user will end upanywhere else gets lower.

The above learning process is particularly helpful in the context of theinstant embodiments, because not all APs 125 on the path are on therendezvous channel (i.e., rendezvous messages are detected by a subsetof the APs 125), and not all APs are on the communication channel ofeach group. However, by coordinating location, trajectory and phases 1,2 and 3 detection, the NAN group detection and channel interferenceremediation logic 190 can detect individual groups and theircharacteristics (member count, location, activity volume and channel).

The result of the learning can be displayed as an overlay on a map (see,e.g., FIG. 3), to provide an administrator with visibility into locationand channels of P2P nodules, and their expected effect on the Wi-Fiinfrastructure service.

It is noted that the predictive component of the described embodimentshelp in that:

-   -   NAN discovery channels are fixed (one channel in 2.4 GHz, one        channel in 5 GHz which is regulatory-domain-dependent);    -   NAN groups can then communicate on a channel different from the        discovery channel; and    -   It is a goal to not just try to locate a device, but to        determine if NAN groups are formed and are present in a        particular location.

NAN Groups

There are two types of NAN groups: longer lasting groups (“Rob'sfamily”) and ad hoc groups formed around a shared topic (“hot doglover”, “Minecraft player” etc.).

Consider a group of friends, or a family going to see a game. They maymeet directly at the seating area (this probability exists), or they maymeet at the stadium or even come together (both probabilities exist).This information is used to locate the group and their members on theirtrajectory to their seats.

Suppose that the NAN discovery channel is 44. As noted above, not allAPs 125 on the path between the lower right entrance and seating area119 will be on channel 44. Additionally, a NAN group may form andexchange data on the discovery channel, or may form on the discoverychannel and meet on another channel to exchange data.

Longer Lasting Groups

Consider a group including “Rob” and his two children who meet at theentrance of the stadium. Each has a phone, and all three phones arelikely members of the Rob's family NAN group. As the group progressesalong path 230 in FIG. 2, it will pass one or more APs 125 on channel44, and quite a few other APs 125 on other channels. As the STAs passthe AP 125 on channel 44, the group will be detected (by, e.g.,monitoring NAN discovery messages). Because this is a permanent group,the phones will stay in the NAN group, and exchange occasionalsynchronization data. This synchronization data exchange may happen onthe NAN discovery channel (44), or on another channel.

In short, the NAN group is maintained by rendezvous points at regularintervals, at which service information is confirmed (i.e., we are inthe same family), then rendezvous points for data exchange are setwhere, a short burst of exchange will confirm what data is being shared(e.g., picture, phone hotspot service, etc.). This happens at regularintervals, even when no one is sharing a picture with the others. Inother words, the group does not need to exchange data to be active froma NAN standpoint.

In this case (Rob's family), the group forms and stays formed. As thegroup is detected by the AP on channel 44, the transit time through theAP cell is sufficient to identify that the group is formed and stays(STAs meet at rendezvous points, stay in sync with the group masteretc.) In other words, on channel 44, the AP detects a NAN discoverywindow, a STA offering service, and one or more STA subscribing to theoffered service. This suggests that this group will likely stay in agroup formation. As this detection repeats on the subsequent APs (likelyon channel 44) detecting the group, the confidence about the stabilityof the group increases.

This information is used by NAN group detection and channel interferenceremediation logic 190 to deduce the presence of one device from thepresence of another. If Rob's phone is detected along the path, forexample because Rob's MAC probed on channel 161 where an AP operates,then there is a probability equivalent to a group stability confidencethat the other 2 phones are also progressing along the same path, evenif they are not detected probing at the same time on that channel 161.In other words, NAN group detection and channel interference remediationlogic 190 can infer the presence of the other members of the group bythe detection of a member of the group, when the group stabilityconfidence is high.

Ad Hoc Groups

Consider, two sport fans just happen to be at the entrance of thestadium at the same time, and that they both have an application runningon their phones that is NAN aware. Both phones will discover and meet onchannel 44. Then a NAN group will form and will stay in sync, for theduration of the time when both phones are in range. This duration can beanywhere between a few seconds and, e.g., the time of a whole game (ifboth fans end up by chance sitting in range of one another). Theprobabilities here depend on the stadium environment and the group type.The longer the users are detected along a similar path, the higher theprobability that detecting the trajectory of one can allow for theprediction of the trajectory of the other.

No NAN Groups

Consider a last, and third, case, where phones scan, discover and meeton channel 44, but do not find any compatible service to share. Thebehavior in this case is that each STA will fall off the group (nosynchronization) and will look for other groups. As a crowd of peopleenter the venue, and passes in range of an AP on channel 44, thisbehavior can also be detected.

Because each of these three scenarios is a probability, and becausecomputing real time certainty for a stadium full of people is difficult,probabilities are employed to predict NAN group location. The behaviordepends on the stadium configuration, on local habits and other factors(e.g., in France, people would never meet inside the stadium, this wouldbe considered impolite, so the training set would show that groups wouldin most cases form outside of the stadium and walk in together).

The behavior, and the chance of seeing a NAN group in seating area 119(FIG. 2) is therefore a combination of multiple factors. This is thereason why NAN group detection and channel interference remediationlogic 190 uses machine learning, to construct a probability for eachevent to occur, based on the observation of events over a large sample.

In other words, the NAN group detection and channel interferenceremediation logic 190, based on a training set, can determine trajectoryprobabilities, deduce the trajectory of a device based on the trajectoryof another device and the detected stability of a NAN group associatedto both devices, and in the end, based on the learned patterns for thestadium and the detected devices at the time of a stadium event, predictthe likely destination of NAN groups.

With the foregoing prediction techniques, it is possible to determinethe possible presence of a NAN group in, e.g., area 119 (FIG. 2), evenif the NAN group is not detected directly in area 119 (e.g., becausenone of the APs in area 119 are on channel 44 or on the group's NAN datachannels).

That is, it is possible, based on the described prediction techniques totell with a high level of confidence that a stable NAN group detectedalong path 230 is, in fact, in area 119, even if that area does not haveAPs 125 on the NAN channels.

It is also possible to predict with a high level of confidence that themembers of that groups are present, even if only a single member (or asubset of members) is detected.

FIG. 3 shows NAN groups on particular channels overlaid on a partialstadium map including access points on particular channels in accordancewith an example embodiment.

It is noted again that NAN discovery channels are not necessarily NANdata communication channels. As such, as users progress along thetrajectories toward their seating areas, NAN communication is detectedby APs 125 on the associated channels, but also direct communicationbetween phones is detected by other APs (e.g., APs on ch 149, 11, 52 and153 in FIG. 3). A STA and frame/s count per group may be used todetermine a nodule density. FIG. 3 depicts a scenario in which APs closeto the NAN groups do not share channels. NAN group detection and channelinterference remediation logic 190 is configured, once a NAN group ispredicted to be in a particular destination, to manage AP channelselection and/or perform other remediation techniques to reduce or avoidinterference between NAN groups and proximate APs.

Channel Interference Remediation

In high-density network infrastructure venues such as stadiums, theWi-Fi access points 125 typically use highly directional antennas due tothe high density of users and the related need for controlled cell sizeand client count. The intended coverage typically results in a set ofseats in a predetermined area, as shown in FIG. 4, in which AP 425(1)serves area 435(1) and nearby or adjacent AP 425(2) serves area 435(2).NAN group 450 may be operating on channel 149. Meanwhile AP 425(2) mayalso be operating on channel 149 and, thus, interference may occur. NANgroup detection and channel interference remediation logic 190 may bemade aware of poor communication between AP 425(2) and STAs in area435(2) and, having predicted that NAN group 450 is located nearby, isconfigured to perform some form of radio resource management remediationto reduce or eliminate the interference caused by the interference inthe AP 425(2) cell.

In this environment, the activity of NAN groups and their effect on thelocal cell is equivalent to the presence of an overlapping cell, in thefollowing aspects:

-   -   When a NAN group communication channel is directly identical to        the channel of the AP covering that same area, and when all NAN        members are within the AP cell area, then normal CSMA/CA rules        apply and the result is normal spectrum sharing. No special        action may be expected in this case.    -   When NAN group members are in positions where only some of them        are within the AP cell (as shown in FIG. 4), then standard        hidden node issues occur.

In the example of FIG. 4, some members of the NAN group 450 are withinarea 435(2). Such members will communicate, respecting standard CSMA/CAtechniques. On the other hand, some members are outside of coverage area435(2) for AP 425(2). Those members do not detect the AP 425(2) traffic,and also do not detect the traffic from many members of the AP cell inarea 435(2). As a result, traffic from NAN group 450 members in area435(2) may collide with traffic from users in area 435(2) served by AP425(2).

It is noteworthy that NAN does not describe any limit for a NAN group.Additionally, NAN allows for relaying, and is not strict on group membercount. As a result, in a dense stadium scenario, it is very possiblethat large groups end up forming (large in terms of distance betweenmembers and in terms of member count). Therefore, the potential fordisturbance is more than “just a pair of phones,” as it depends on theimplementation and the group types.

Thus, as noted, NAN group detection and channel interference remediationlogic 190, once it has predicted the destination of a NAN group, isconfigured to undertake one or more channel interference remediationtechniques in an attempt to avoid interference between NAN groups andnearby APs or APs having adjacent or overlapping coverage areas (where“nearby” means close enough to receive interfering transmissions fromthe NAN group).

There are several general approaches to remediate channel interference.

Approach (1): One way to avoid channel interference is to pre-emptivelychange the operating channel of an AP 125 that is nearby a predicteddestination of a NAN group that happens to be on the same channel. Insuch a scenario, NAN group detection and channel interferenceremediation logic 190, predicts the destination of a NAN group and thencauses any nearby APs 125 to change their channels. The result of such ascenario is depicted in FIG. 3, where none of the AP channels overlapswith nearby NAN group channels.

Approach (2): In another approach, the nearby AP can take ownership ofindividual NAN groups by becoming the Anchor master (by setting highmaster priority). In this mode, the AP can redirect the groupcommunication to another channel, not in use by APs in the local area.That is, NAN group detection and channel interference remediation logic190, instead of moving the AP's channel, causes the nearby AP to movethe NAN group's channel. FIG. 3 could also be the result of thisapproach.

Approach (3): In still another approach, when multiple NAN groups are inthe same area, they may use uncoordinated rendezvous points (becausetheir master is not in range of one another). In this scenario, NANgroup detection and channel interference remediation logic 190 can causethe AP to use clock sync to override the master announcements and forcethe various groups to meet at the same time, thus limiting the impact onthe wireless infrastructure traffic.

Approach (4): In yet another approach, NAN group detection and channelinterference remediation logic 190 can cause large and noisy groups tobe broken by increasing the announced hop count to the master. When asingle group is deconstructed (over a large area), participating APs cancoordinate to set each sub-group to a channel that is not disruptive tothe wireless infrastructure and relay traffic between the sub groups.

Regarding approach (2), there may be several elements to consider.

The NAN group master selects the communication channel and informs thegroup members. Therefore, the view of the ‘best channel’ to use dependson the master's view on the one hand, and on any adaptive mechanismsimplemented, on the other hand. Therefore, if the NAN group master isoutside of the AP 425(2) service area 435(2), then the master may choosea channel that will overlap with the AP 425(2) channel (it may also, ofcourse, chose a different channel).

Once a channel is chosen, NAN makes no provisions on when the channelwill be changed. In some implementations a static initial channel isused (which does not give any consideration to possible overlap with anearby AP channel until performance degrades to the point ofnon-usability from the point of view of the master). Otherimplementations may use initial adaptation mechanisms, but thesemechanisms may not account for anything else other than the master'sview.

In the hidden node scenario, where a NAN group partially overlaps withan AP cell, the collisions degrade the experience of both the NAN groupmembers and cell STAs (in the collision area). The master may not beaware of the issue (because it does not detect the AP). In thisscenario, changing the AP channel is one possible remediation technique.However, such a change may be difficult because of the channel plan(i.e., such a change could negatively affect multiple users in multipleother cells). A dynamic channel assignment (DCA) of the RRM system maythen compute that the outcome would be better if the overlapping NANgroup changes to another channel.

In general, the “interest” of NAN group members is to meet and exchangevia the service (then exchange data if applicable). Success of theseoperations is part of the group interest, and collisions with nearbysystems is not in the group's interest. However, NAN has no mechanism todetect such collision issues (if the NAN master is not directlyaffected). The techniques described herein thus allow for higher successrate in the exchanges.

Regarding remediation approach (3), the purpose of NAN is to providerendezvous points in time, windows of times where member of a group canmeet so as to exchange information on services (i.e., exchanges that canhappen between members). At the time rendezvous point provided by themaster, a window opens when participating STAs can describe theservice(s) they provide, hear others NAN broadcasts, and provide a timewindow where further data exchange is provided.

When two groups are in the same area, with STAs hearing both groups, butwhere the masters are not in range of one another (this can easilyhappen in a stadium environment, where people can create absorption atground level while the signal to and from the AP on the ceiling is stillclear), the following hidden node issue between NAN groups can happen.

At time t0, group 1 starts the discovery window. STA1 in group 1 gives arendezvous point for service 1 data sharing at time t1.

At time t1, STAs in group 1 tune in to receive STA1 data, causing thatspectrum to be busy with STA1 data transmission. At the same time, agroup 2 discovery window starts, and fails because STA1 traffic lastsfor more than group 2 discovery window.

In a variation of the same issue, STA1 (in group 1) and STA2 (in group2) give overlapping data transmission windows, because they are indifferent groups, did not sync, and did not consider the other'stransmission window. When STAs in group 2 tune in to the window, theyfind STA 1 traffic and timeout. As such, one of the groups fails toachieve its goal.

In a variation of the same issue, where the STAs do not use a defaultdata channel identical to the discovery channel, STA1 may be on the datachannel while group 2 is in a discovery window. This prevents the NANgroup browser functions from operating properly.

The foregoing issue can be resolved by helping both groups in the samearea gain awareness of each other. This is achieved, in accordance withan embodiment, by ensuring that both groups can hear each other'sservice and data window information exchanges. The AP, being in range ofboth groups, can help this awareness by, at the behest of NAN groupdetection and remediation logic 190, taking the master role and settingthe discovery window for both group to be set at the same time.

As both groups share the same discovery window, they share the same timewindow to inform one another about their services. However, the tradeoffchosen is ‘shared time’ or ‘collisions because of cell overlap’. Thissolution does not solve the issue that a high density of STAs have toshare time slices. The foregoing approach limits the collisions byensuring mutual awareness.

It is again noted that in the NAN process, the discovery window is usedfor STAs offering services to advertise the same, then each STA offeringservice informs the others of a time window (and channel) where thisdata will be shared. By having both groups in the same discovery window,a STA in group 2 will hear the STA in group 1 offering a data window,and will (as per NAN) offer a different time window for its own data,thus limiting collisions.

Regarding Approach (4), it is noted that this technique does notnecessitate the AP to operate on multiple channels. Rather, the goal isto break up the group in multiple channels when the group is large. TheAP then acts as a relay between the nodes. If the group is very large,then more than one AP can be involved, each on its respective channel.

More specifically, in accordance with the NAN protocol, and as notedpreviously, the discovery window is limited in duration and impact onthe cell. During that window, one or more STAs are going to advertisedata exchange rendezvous points (time and channel). In most cases, thechannel is going to be the same as the advertisement channel. In somecases, the STA may select and indicate another channel. In that case, asper NAN, the other STAs that may also advertise data exchange rendezvouspoints during the discovery window will announce the same channel as thefirst announcing STA and other times (otherwise, if they wereadvertising different channels, participating STAs would need to hopfrom channel to channel, which is impractical; if they were advertisingsimilar rendezvous points in time, transmissions would collide).

If the data channel is different from the local AP channel, then thereis no impact on the infrastructure (and no action is needed). If thedata channel is the same as the local AP channel, then the NAN grouptraffic will affect the local AP cell.

In large groups, the consumed airtime may increase dramatically, becauseof the NAN process: the advertising STA sends its window of datatransmissions, and other STAs can subscribe (“I'll be at the rendezvouspoint”). When these STAs are far away from each other, two events mayoccur. The STA that will transmit, needing to account for the farthestsubscriber, and will thus send at low data rate, using more airtime.And, when STAs detect that the signal from the offering STA is low, theycan ask for a relay (other subscribing STAs are requested and accept torelay, which extends the group size and worsens the consumed airtime, asthe same frame is repeated).

In such a case, the AP can break the group by advertising the relayfunction. In this mode, participating STAs that are far from thetransmitting STA will receive traffic through the AP, thus allowing thetransmitting STA to send at a data rate compatible with its distance tothe AP, instead of degrading to a low data rate.

Recall that, in a stadium environment, STA to AP signal (“ground toceiling”) is likely better than the STA to STA signal when STAs are notnear each other (as the signal has multiple bodies to go through),therefore STA to STA data rate degrades faster than STA to AP for acomparable distance.

With this relay mode, the AP 125 expedites the distribution of data forthe group. This has benefit for the infrastructure only if thetransmission is also on the AP channel (otherwise, NAN transmission isslow but does not affect cell users).

When users are far enough away from each other such that the group spansacross two or more AP cells, the neighboring APs are likely to be ondifferent channels, so only one AP channel would be affected (if bothAPs are on the same channel and both affected, then APs can relay thetraffic to one another). As the affected AP relays traffic, it willrelay to the NAN STAs that are at the edge of the effected cell. Thismode may be enabled when the STA-AP-EDGE STA consumed airtime isestimated to be less than STA-EDGE STA consumed airtime (thisdetermination is trivial, as the AP initially detects the STA-EDGE STAframes, and also knows the STA-AP and AP-EDGE STA data rate).

In sum, NAN group detection and channel interference remediation logic190 may be configured to employ an iterative learning scheme to detectP2P groups that form as users move and connect to exchange to NAN. Thisprocess enables NAN group detection and channel interference remediationlogic 190 to learn, detect and predict location of P2P nodes, includingwhen nearby APs are not on the P2P channels. NAN group detection andchannel interference remediation logic 190 can also estimate the impactof the groups on the target channel. This information may fed into amapping application for display for an administrator, but can also beused to improve the radio resource management (RRM) channel plan bypredicting NAN stations location with respect to localized RFneighborhoods.

FIG. 5 is a flow chart depicting a series of operations performed by NANgroup detection and channel interference remediation logic 190 n inaccordance with an example embodiment. At operation 510, the logic isconfigured to detect, using wireless access points, neighbor awarenessnetworking (NAN) communications broadcast by a mobile device. Atoperation 512, the logic is configured to determine a wireless channelon which the mobile device is sending the NAN communications. Atoperation 514, the logic is configured to predict a destination of themobile device based on a path, through a predetermined venue, beingtaken by the mobile device, the path being detected using the wirelessaccess points. And, at operation 516, the logic is configured toimplement a radio resource management (RRM) remediation technique toreduce radio interference that is expected to be caused the NANcommunications broadcast by the mobile device at the destination basedon the wireless channel and the destination.

FIG. 6 depicts a device 600 (e.g., a server that executes NAN groupdetection and channel interference remediation logic 190) in accordancewith an example embodiment. It should be appreciated that FIG. 6provides only an illustration of one embodiment and does not imply anylimitations with regard to the environments in which differentembodiments may be implemented. Many modifications to the depictedenvironment may be made.

As depicted, the device 600 includes a bus 612, which providescommunications between computer processor(s) 614, memory 616, persistentstorage 618, communications unit 620, and input/output (I/O)interface(s) 622. Bus 612 can be implemented with any architecturedesigned for passing data and/or control information between processors(such as microprocessors, communications and network processors, etc.),system memory, peripheral devices, and any other hardware componentswithin a system. For example, bus 612 can be implemented with one ormore buses.

Memory 616 and persistent storage 618 are computer readable storagemedia. In the depicted embodiment, memory 616 includes random accessmemory (RAM) 624 and cache memory 626. In general, memory 616 caninclude any suitable volatile or non-volatile computer readable storagemedia.

One or more programs (e.g., NAN group detection and channel interferenceremediation logic 190) may be stored in persistent storage 618 forexecution by one or more of the respective computer processors 614 viaone or more memories of memory 616. The persistent storage 618 may be amagnetic hard disk drive, a solid state hard drive, a semiconductorstorage device, read-only memory (ROM), erasable programmable read-onlymemory (EPROM), flash memory, or any other computer readable storagemedia that is capable of storing program instructions or digitalinformation. For example, the one or more programs may include softwareinstructions that, when executed by the one or more processors 614,cause the computing device 600 to perform the operations of, e.g., FIG.5.

The media used by persistent storage 618 may also be removable. Forexample, a removable hard drive may be used for persistent storage 618.Other examples include optical and magnetic disks, thumb drives, andsmart cards that are inserted into a drive for transfer onto anothercomputer readable storage medium that is also part of persistent storage618.

Communications unit 620, in these examples, provides for communicationswith other data processing systems or devices. In these examples,communications unit 620 includes one or more network interface cards.Communications unit 620 may provide communications through the use ofeither or both physical and wireless communications links.

I/O interface(s) 622 allows for input and output of data with otherdevices that may be connected to computer device 600. For example, I/Ointerface 622 may provide a connection to external devices 628 such as akeyboard, keypad, a touch screen, and/or some other suitable inputdevice. External devices 628 can also include portable computer readablestorage media such as database systems, thumb drives, portable opticalor magnetic disks, and memory cards.

Software and data used to practice embodiments can be stored on suchportable computer readable storage media and can be loaded ontopersistent storage 618 via I/O interface(s) 622. I/O interface(s) 622may also connect to a display 630. Display 630 provides a mechanism todisplay data to a user and may be, for example, a computer monitor.

The programs described herein are identified based upon the applicationfor which they are implemented in a specific embodiment. However, itshould be appreciated that any particular program nomenclature herein isused merely for convenience, and thus the embodiments should not belimited to use solely in any specific application identified and/orimplied by such nomenclature.

Data relating to operations described herein may be stored within anyconventional or other data structures (e.g., files, arrays, lists,stacks, queues, records, etc.) and may be stored in any desired storageunit (e.g., database, data or other repositories, queue, etc.). The datatransmitted between entities may include any desired format andarrangement, and may include any quantity of any types of fields of anysize to store the data. The definition and data model for any datasetsmay indicate the overall structure in any desired fashion (e.g.,computer-related languages, graphical representation, listing, etc.).

The present embodiments may employ any number of any type of userinterface (e.g., Graphical User Interface (GUI), command-line, prompt,etc.) for obtaining or providing information (e.g., data relating toscraping network sites), where the interface may include any informationarranged in any fashion. The interface may include any number of anytypes of input or actuation mechanisms (e.g., buttons, icons, fields,boxes, links, etc.) disposed at any locations to enter/displayinformation and initiate desired actions via any suitable input devices(e.g., mouse, keyboard, etc.). The interface screens may include anysuitable actuators (e.g., links, tabs, etc.) to navigate between thescreens in any fashion.

The environment of the present embodiments may include any number ofcomputer or other processing systems (e.g., client or end-user systems,server systems, etc.) and databases or other repositories arranged inany desired fashion, where the present embodiments may be applied to anydesired type of computing environment (e.g., cloud computing,client-server, network computing, mainframe, stand-alone systems, etc.).The computer or other processing systems employed by the presentembodiments may be implemented by any number of any personal or othertype of computer or processing system (e.g., desktop, laptop, PDA,mobile devices, etc.), and may include any commercially availableoperating system and any combination of commercially available andcustom software (e.g., machine learning software, etc.). These systemsmay include any types of monitors and input devices (e.g., keyboard,mouse, voice recognition, etc.) to enter and/or view information.

It is to be understood that the software of the present embodiments maybe implemented in any desired computer language and could be developedby one of ordinary skill in the computer arts based on the functionaldescriptions contained in the specification and flow charts illustratedin the drawings. Further, any references herein of software performingvarious functions generally refer to computer systems or processorsperforming those functions under software control. The computer systemsof the present embodiments may alternatively be implemented by any typeof hardware and/or other processing circuitry.

The various functions of the computer or other processing systems may bedistributed in any manner among any number of software and/or hardwaremodules or units, processing or computer systems and/or circuitry, wherethe computer or processing systems may be disposed locally or remotelyof each other and communicate via any suitable communications medium(e.g., LAN, WAN, Intranet, Internet, hardwire, modem connection,wireless, etc.). For example, the functions of the present embodimentsmay be distributed in any manner among the various end-user/client andserver systems, and/or any other intermediary processing devices. Thesoftware and/or algorithms described above and illustrated in the flowcharts may be modified in any manner that accomplishes the functionsdescribed herein. In addition, the functions in the flow charts ordescription may be performed in any order that accomplishes a desiredoperation.

The software of the present embodiments may be available on anon-transitory computer useable medium (e.g., magnetic or opticalmediums, magneto-optic mediums, floppy diskettes, CD-ROM, DVD, memorydevices, etc.) of a stationary or portable program product apparatus ordevice for use with stand-alone systems or systems connected by anetwork or other communications medium.

The communication network may be implemented by any number of any typeof communications network (e.g., LAN, WAN, Internet, Intranet, VPN,etc.). The computer or other processing systems of the presentembodiments may include any conventional or other communications devicesto communicate over the network via any conventional or other protocols.The computer or other processing systems may utilize any type ofconnection (e.g., wired, wireless, etc.) for access to the network.Local communication media may be implemented by any suitablecommunication media (e.g., local area network (LAN), hardwire, wirelesslink, Intranet, etc.).

The system may employ any number of any conventional or other databases,data stores or storage structures (e.g., files, databases, datastructures, data or other repositories, etc.) to store information(e.g., data relating to contact center interaction routing). Thedatabase system may be implemented by any number of any conventional orother databases, data stores or storage structures (e.g., files,databases, data structures, data or other repositories, etc.) to storeinformation (e.g., data relating to contact center interaction routing).The database system may be included within or coupled to the serverand/or client systems. The database systems and/or storage structuresmay be remote from or local to the computer or other processing systems,and may store any desired data (e.g., data relating to contact centerinteraction routing).

The embodiments presented may be in various forms, such as a system, amethod, and/or a computer program product at any possible technicaldetail level of integration. The computer program product may include acomputer readable storage medium (or media) having computer readableprogram instructions thereon for causing a processor to carry outaspects of presented herein.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present embodiments may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects presented herein.

Aspects of the present embodiments are described herein with referenceto flowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to the embodiments.It will be understood that each block of the flowchart illustrationsand/or block diagrams, and combinations of blocks in the flowchartillustrations and/or block diagrams, can be implemented by computerreadable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments. In this regard, each block in the flowchart or blockdiagrams may represent a module, segment, or portion of instructions,which comprises one or more executable instructions for implementing thespecified logical function(s). In some alternative implementations, thefunctions noted in the blocks may occur out of the order noted in thefigures. For example, two blocks shown in succession may, in fact, beexecuted substantially concurrently, or the blocks may sometimes beexecuted in the reverse order, depending upon the functionalityinvolved. It will also be noted that each block of the block diagramsand/or flowchart illustration, and combinations of blocks in the blockdiagrams and/or flowchart illustration, can be implemented by specialpurpose hardware-based systems that perform the specified functions oracts or carry out combinations of special purpose hardware and computerinstructions.

In summary, in one form, a method is provided. The method includesdetecting, using wireless access points, neighbor awareness networking(NAN) communications broadcast by a mobile device; determining awireless channel on which the mobile device is sending the NANcommunications; predicting a destination of the mobile device based on apath, through a predetermined venue, being taken by the mobile device,the path being detected using the wireless access points; andimplementing a radio resource management remediation technique to reduceradio interference that is expected to be caused by the NANcommunications broadcast by the mobile device at the destination basedon the wireless channel and the destination.

The venue may include a high density wireless infrastructure such asmight be found in a stadium or conference center.

In an embodiment, predicting the destination of the mobile device mayinclude using machine learning.

In one embodiment, implementing the radio resource managementremediation technique to reduce radio interference that is expected tobe caused by the mobile device at the destination may be based on anumber of mobile device participants in a NAN group at the destination

In another embodiment, the radio resource management remediationtechnique may include changing a channel of operation of an access pointthat serves the destination.

In still another embodiment, the radio resource management remediationtechnique may include changing a channel of operation of an access pointthat serves an area adjacent the destination.

The radio resource management remediation technique may also includecausing an access point that serves the destination to become a memberof a NAN group that includes the mobile device, and causing the accesspoint that serves the destination to become an anchor master of the NANgroup and cause the NAN group to switch to a channel different from achannel being used by the access point that serves the destination.

The radio resource management remediation technique may still alsoinclude causing an access point that serves the destination to become amember of a NAN group that includes the mobile device, and to furtheroperate as a NAN relay node.

The method still further include displaying an indication of a NAN groupthat includes the mobile device on a map of the predetermined venue.

In another form, a device may also be provided in accordance with anembodiment. The device may include an interface unit configured toenable network communications; a memory; and one or more processorscoupled to the interface unit and the memory, and configured to: detect,using wireless access points, neighbor awareness networking (NAN)communications broadcast by a mobile device; determine a wirelesschannel on which the mobile device is sending the NAN communications;predict a destination of the mobile device based on a path, through apredetermined venue, being taken by the mobile device, the path beingdetected using the wireless access points; and implement a radioresource management remediation technique to reduce radio interferencethat is expected to be caused by the NAN communications broadcast by themobile device at the destination based on the wireless channel and thedestination.

In an embodiment the one or more processors may be configured toimplement the radio resource management remediation technique to reduceradio interference that is expected to be caused by the mobile device atthe destination based on a number of mobile device participants in a NANgroup at the destination.

The radio resource management remediation technique may include changinga channel of operation of an access point that serves the destination.

The radio resource management remediation technique may include changinga channel of operation of an access point that serves an area adjacentthe destination.

The radio resource management remediation technique may include causingan access point that serves the destination to become a member of a NANgroup that includes the mobile device, and causing the access point thatserves the destination to become an anchor master of the NAN group andcause the NAN group to switch to a channel different from a channelbeing used by the access point that serves the destination.

The radio resource management remediation technique may include causingan access point that serves the destination to become a member of a NANgroup that comprises the mobile device, and to further operate as a NANrelay node.

In still another form, a non-transitory computer readable storage mediais provided that is encoded with instructions that, when executed by aprocessor, cause the processor to detect, using wireless access points,neighbor awareness networking (NAN) communications broadcast by a mobiledevice; determine a wireless channel on which the mobile device issending the NAN communications; predict a destination of the mobiledevice based on a path, through a predetermined venue, being taken bythe mobile device, the path being detected using the wireless accesspoints; and implement a radio resource management remediation techniqueto reduce radio interference that is expected to be caused by the NANcommunications broadcast by the mobile device at the destination basedon the wireless channel and the destination.

The instructions may further include instructions that, when executed bya processor, cause the processor to implement the radio resourcemanagement remediation technique to reduce radio interference that isexpected to be caused by the mobile device at the destination based on anumber of mobile device participants in a NAN group at the destination.

The radio resource management remediation technique may include causingan access point that serves the destination to become a member of a NANgroup that includes the mobile device, and causing the access point thatserves the destination to become an anchor master of the NAN group andcause the NAN group to switch to a channel different from a channelbeing used by the access point that serves the destination.

The radio resource management remediation technique may include causingan access point that serves the destination to become a member of a NANgroup that comprises the mobile device, and to further operate as a NANrelay node.

The above description is intended by way of example only. Variousmodifications and structural changes may be made therein withoutdeparting from the scope of the concepts described herein and within thescope and range of equivalents of the claims.

What is claimed is:
 1. A method comprising: detecting, using wirelessconnection points, peer-to-peer communications broadcast by a pluralityof mobile devices participating in a peer-to-peer networking group;determining a wireless channel on which the peer-to-peer networkinggroup is sending the peer-to-peer communications; predicting adestination of the peer-to-peer networking group based on a path,through a predetermined venue, being taken by the peer-to-peernetworking group, the path being detected using the wireless connectionpoints; and implementing a radio resource management remediationtechnique to reduce radio interference that is expected to be caused bythe peer-to-peer communications broadcast by the peer-to-peer networkinggroup at the destination based on the wireless channel and thedestination.
 2. The method of claim 1, wherein the predetermined venuecomprises a high density wireless infrastructure.
 3. The method of claim2, wherein the predetermined venue is one of a stadium or conferencecenter.
 4. The method of claim 1, wherein predicting the destination ofthe peer-to-peer networking group comprises using machine learning. 5.The method of claim 1, further comprising implementing the radioresource management remediation technique to reduce radio interferencethat is expected to be caused by the peer-to-peer networking group atthe destination based on a number of mobile device participants in thepeer-to-peer networking group at the destination.
 6. The method of claim1, wherein the radio resource management remediation technique compriseschanging a channel of operation of a connection point that serves thedestination.
 7. The method of claim 1, wherein the radio resourcemanagement remediation technique comprises changing a channel ofoperation of a connection point that serves an area adjacent thedestination.
 8. The method of claim 1, wherein the radio resourcemanagement remediation technique comprises causing a connection pointthat serves the destination to become a member of the peer-to-peernetworking group, and causing the connection point that serves thedestination to become an anchor master of the peer-to-peer networkinggroup and cause the peer-to-peer networking group to switch to a channeldifferent from a channel being used by the connection point that servesthe destination.
 9. The method of claim 1, wherein the radio resourcemanagement remediation technique comprises causing a connection pointthat serves the destination to become a member of the peer-to-peernetworking group, and to further operate as a peer-to-peer networkinggroup relay node.
 10. The method of claim 1, further comprisingdisplaying an indication of the peer-to-peer networking group on a mapof the predetermined venue.
 11. A device comprising: an interface unitconfigured to enable network communications; a memory; and one or moreprocessors coupled to the interface unit and the memory, and configuredto: detect, using wireless connection points, peer-to-peercommunications broadcast by a mobile devices participating in apeer-to-peer networking group; determine a wireless channel on which thepeer-to-peer networking group is sending the peer-to-peercommunications; predict a destination of the peer-to-peer networkinggroup based on a path, through a predetermined venue, being taken by thepeer-to-peer networking group, the path being detected using thewireless connection points; and implement a radio resource managementremediation technique to reduce radio interference that is expected tobe caused by the peer-to-peer communications broadcast by thepeer-to-peer networking group at the destination based on the wirelesschannel and the destination.
 12. The device of claim 11, wherein the oneor more processors are configured to implement the radio resourcemanagement remediation technique to reduce radio interference that isexpected to be caused by the peer-to-peer networking group at thedestination based on a number of mobile device participants in thepeer-to-peer networking group at the destination.
 13. The device ofclaim 11, wherein the radio resource management remediation techniquecomprises changing a channel of operation of a connection point thatserves the destination.
 14. The device of claim 11, wherein the radioresource management remediation technique comprises changing a channelof operation of a connection point that serves an area adjacent thedestination.
 15. The device of claim 11, wherein the radio resourcemanagement remediation technique comprises causing a connection pointthat serves the destination to become a member of the peer-to-peernetworking group, and causing the connection point that serves thedestination to become an anchor master of the peer-to-peer networkinggroup and cause the peer-to-peer networking group to switch to a channeldifferent from a channel being used by the connection point that servesthe destination.
 16. The device of claim 11, wherein the radio resourcemanagement remediation technique comprises causing a connection pointthat serves the destination to become a member of the peer-to-peernetworking group, and to further operate as a peer-to-peer networkinggroup relay node.
 17. A non-transitory computer readable storage mediaencoded with instructions that, when executed by a processor, cause theprocessor to: detect, using wireless connection points, peer-to-peercommunications broadcast by a plurality of mobile devices participatingin a peer-to-peer networking group; determine a wireless channel onwhich the peer-to-peer networking group is sending the peer-to-peercommunications; predict a destination of the peer-to-peer networkinggroup based on a path, through a predetermined venue, being taken by thepeer-to-peer networking group, the path being detected using thewireless connection points; and implement a radio resource managementremediation technique to reduce radio interference that is expected tobe caused by the peer-to-peer communications broadcast by thepeer-to-peer networking group at the destination based on the wirelesschannel and the destination.
 18. The non-transitory computer readablestorage media of claim 17, further including instructions that, whenexecuted by the processor, cause the processor to implement the radioresource management remediation technique to reduce radio interferencethat is expected to be caused by the peer-to-peer networking group atthe destination based on a number of mobile device participants in thepeer-to-peer networking group at the destination.
 19. The non-transitorycomputer readable storage media of claim 17, wherein the radio resourcemanagement remediation technique comprises causing a connection pointthat serves the destination to become a member of the peer-to-peernetworking group, and causing the connection point that serves thedestination to become an anchor master of the peer-to-peer networkinggroup and cause the peer-to-peer networking group to switch to a channeldifferent from a channel being used by the connection point that servesthe destination.
 20. The non-transitory computer readable storage mediaof claim 17, wherein the radio resource management remediation techniquecomprises causing a connection point that serves the destination tobecome a member of the peer-to-peer networking group, and to furtheroperate as a peer-to-peer networking group relay node.